Solving a 6120 -bit DLP on a Desktop Computer
نویسندگان
چکیده
In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. In particular, we demonstrate a practical DLP break in the finite field of 2 elements, using just a single core-month.
منابع مشابه
Breaking pairing-based cryptosystems
In this paper, we discuss solving the DLP over GF (36·97) by using the function field sieve (FFS) for breaking paring-based cryptosystems using the ηT pairing over GF (3 ). The extension degree 97 has been intensively used in benchmarking tests for the implementation of the ηT pairing, and the order (923-bit) of GF (3 6·97) is substantially larger than the previous world record (676-bit) of sol...
متن کاملBreaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
There are many useful cryptographic schemes, such as ID-based encryption, short signature, keyword searchable encryption, attribute-based encryption, functional encryption, that use a bilinear pairing. It is important to estimate the security of such pairing-based cryptosystems in cryptography. The most essential number-theoretic problem in pairing-based cryptosystems is the discrete logarithm ...
متن کاملSolving a 676-Bit Discrete Logarithm Problem in GF(36n)
Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The ηT pairing on supersingular curves over GF(3) is particularly popular since it is efficiently implementable. Taking into account the Menezes-Okamoto-Vanstone (MOV) attack, the discrete logarithm problem (DLP) in GF(3) becomes a concern for the security of cryptosystems using ηT pairing...
متن کاملAn Attack on a Trace-Zero Cryptosystem
It was recently proposed in the literature that the discretelogarithm problem (DLP) in trace-zero groups of genus 2 curves withrespect to constant field extensions of degree 3 is a fast and secure al-ternative to the well established cryptographic primitive of the DLP in elliptic curves over prime fields. We present a novel attack on this primitive. We show that the DLP inthe tr...
متن کاملHigh-speed high-accuracy three- dimensional shape measurement using digital binary defocusing method versus sinusoidal method
This paper presents our research findings on high-speed high-accuracy three-dimensional shape measurement using digital light processing (DLP) technologies. In particular, we compare two different sinusoidal fringe generation techniques using the DLP projection devices: direct projection of computer-generated 8-bit sinusoidal patterns (a.k.a., the sinusoidal method), and the creation of sinusoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013